Iterative Design for the Common Solution of Monotone Inclusions and Variational Inequalities
نویسندگان
چکیده
Some new forward–backward multi-choice iterative algorithms with superposition perturbations are presented in a real Hilbert space for approximating common solution of monotone inclusions and variational inequalities. ideas constructing elements can be found strong convergence theorems proved under mild restrictions, which extend complement some already existing work.
منابع مشابه
Minty Variational Inequalities and Monotone Trajectories of Differential Inclusions
In [8] the notion of “projected differential equation” has been introduced and the stability of solutions has been studied by means of Stampacchia type variational inequalities. More recently, in [20], Minty variational inequalities have been involved in the study of properties of the trajectories of such a projected differential equation. We consider classical generalizations of both problems,...
متن کاملRegularization and Iterative Methods for Monotone Variational Inequalities
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We provide a general regularization method for monotone variational inequalities, where the regularizer is a Lipschitz continuous and strongly monotone operator. We also introduce an...
متن کاملSplit Monotone Variational Inclusions
Based on the very recent work by Censor-Gibali-Reich [7], we propose an extension of their new variational problem (Split Variational Inequality Problem) to monotone variational inclusions. Relying on the Krasnoselskii-Mann Theorem for averaged operators, we analyze an algorithm for solving a new split monotone inclusions under weaker conditions. Our results improve and develop previously discu...
متن کاملOn Two Iterative Methods for Mixed Monotone Variational Inequalities
A mixed monotone variational inequality MMVI problem in a Hilbert space H is formulated to find a point u∗ ∈ H such that 〈Tu∗, v − u∗〉 φ v − φ u∗ ≥ 0 for all v ∈ H, where T is a monotone operator and φ is a proper, convex, and lower semicontinuous function onH. Iterative algorithms are usually applied to find a solution of an MMVI problem. We show that the iterative algorithm introduced in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9131504